Optimum Test Suite Using Fault-Type Coverage-Based Ant Colony Optimization Algorithm

نویسندگان

چکیده

Software Product Lines(SPLs) covers a mixture of features for testing Application Program(SPA). Testing cost reduction is major metric software testing. In combinatorial testing(CT), maximization fault type coverage and test suite plays key role to reduce the SPA. Metaheuristic Genetic Algorithm(GA) do not offer best outcome optimization problem due mutation operation required more computational time. So, Fault-Type Coverage Based Ant Colony Optimization(FTCBACO) algorithm offered in CT. FTCBACO starts with cases assign separate ant each case. Ants elect by updating pheromone trails selection higher probability trails. Best case path least time are taken as optimal solution performing Hence, Technique enriches rate minimizes reducing efficiently

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation and Analysis of the Bee Colony Optimization algorithm for Fault based Regression Test Suite Prioritization

Regression Testing is an important maintenance phase testing activity. The importance of this activity lies in the fact that it imparts confidence and accuracy in the modified code, as well as keeps a check on the unmodified parts, if they are affected or not. But there is a severe requirement to reorder the development testing test suite because of the constrained software development budget, ...

متن کامل

Ant Colony Optimization Algorithm

Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.

متن کامل

NoC-Based SoC Test Scheduling Using Ant Colony Optimization

Jin-Ho Ahn et al. 129 In this paper, we propose a novel ant colony optimization (ACO)-based test scheduling method for testing network-on-chip (NoC)-based systems-on-chip (SoCs), on the assumption that the test platform, including specific methods and configurations such as test packet routing, generation, and absorption, is installed. The ACO metaheuristic model, inspired by the ant’s foraging...

متن کامل

Information Hiding Using Ant Colony Optimization Algorithm

This paper aims to find an effective and efficient information hiding method used for protecting secret information by embedding it in a cover media such as images. Finding the optimal set of the image pixel bits to be substituted by the secret message bits, such that the cover image is of high quality, is a complex process and there is an exponential number of feasible solutions. Two new ant-b...

متن کامل

Path Optimization Using Ant Colony Based Multipath Routing Algorithm

Energy efficiency is always important in wireless sensor networks. In a sensor network the nodes are present with limited energy and in each transmission nodes loss some energy. It is required to minimize the rerouting to save the energy loss. Here An algorithm for energy efficient maximally covered sensor network is presented. The initial route will be identified by the Path Selection algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Applied Metaheuristic Computing

سال: 2022

ISSN: ['1947-8291', '1947-8283']

DOI: https://doi.org/10.4018/ijamc.2022010106